The Maximum Number of 3- and 4-Cliques within a Planar Maximally Filtered Graph
نویسندگان
چکیده
Planar Maximally Filtered Graphs (PMFG) are an important tool for filtering the most relevant information from correlation based networks such as stockmarket networks. One of themain characteristics of a PMFG is the number of its 3and 4-cliques. Recently in a few high impact papers it was stated that, based on heuristic evidence, the maximum number of 3and 4-cliques that can exist in a PMFGwith n vertices is 3n−8 and n−4 respectively. In this paper, we prove that this is indeed the case. © 2014 Elsevier B.V. All rights reserved.
منابع مشابه
On the Maximum Number of Cliques in a Graph
A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for various graph classes. For example, the maximum number of cliques in a planar graph with n vertices is 8(n − 2).
متن کاملOuterplanar and planar oriented cliques
The clique number of an undirected graphG is the maximum order of a complete subgraph of G and is a well-known lower bound for the chromatic number ofG. Every proper k-coloring of G may be viewed as a homomorphism (an edge-preserving vertex mapping) of G to the complete graph of order k. By considering homomorphisms of oriented graphs (digraphs without cycles of length at most 2), we get a natu...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملNP-hardness of the recognition of coordinated graphs
A graph G is coordinated if the minimum number of colors that can be assigned to the cliques of H in such a way that no two cliques with non-empty intersection receive the same color is equal to the maximum number of cliques of H with a common vertex, for every induced subgraph H of G. Coordinated graphs are a subclass of perfect graphs. In a previous work, polynomial time algorithms were found...
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1507.02929 شماره
صفحات -
تاریخ انتشار 2014